/*Emamul Islam Emon.      Id No: 093-15-844

  11) Example of Selection Sort.    */







#include<stdio.h>
#include<conio.h>
int min(int a[], int n, int k)
{
	int mine, loc, j, d;
	mine = a[k];
	loc = k;
	for (j = k + 1;j <= n;j++)
		if (mine > a[j])
		{
			mine = a[j];
			loc = j;
		}
	return loc;
}
int main()
{
	int n, k,a[20] ,i, temp, p;
	clrscr();
	printf("Enter the number of Unsorted element:");
	scanf("%d", &n);
	for (i = 1;i <= n;i++)
		scanf("%d", &a[i]);
	for (k = 1;k < n;k++)
	{
		p = min(a, n, k);
		temp = a[k];
		a[k] = a[p];
		a[p] = temp;
	}
	for (i = 1;i <= n;i++)
		printf("%d\t", a[i]);
	getch();
	return 0;
}





















































